#include"priority_queue.h"

void test1()
{
	hu::priority_queue<int> pq;
	pq.push(1);
	pq.push(3);
	pq.push(6);
	pq.push(2);
	pq.push(7);
	pq.push(9);
	pq.pop();
	cout <<pq.size()<<":"<<pq.top();
}

void test2()
{
	vector<int> v;
	v.push_back(111);
	v.push_back(14);
	v.push_back(13);
	v.push_back(12);
	v.push_back(15);
	v.push_back(199);
	v.push_back(156);
	v.push_back(195);
	v.push_back(176);
	v.push_back(12);
	v.push_back(14);
	v.push_back(16);
	v.push_back(51);
	v.push_back(1);
	v.push_back(41);
	v.push_back(21);
	v.push_back(1);
	v.push_back(13);
	v.push_back(4);
	hu::priority_queue<int> pq(v.begin(),v.end());
	cout << pq.size() << endl;
}
int main()
{
	test2();
	return 0;
}